package leetcode.D100.T56;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M56>
 * @Author: DYZ
 * @Create: 2021-08-12 16:12:58 星期四
 */

public class M56 {
    public static void main(String[] args) {
        int[][] intervals = GraphUtil.parseGraph("[[1,3],[2,6],[8,10],[15,18]]");
        int[][] result = new Solution().merge(intervals);
        GraphUtil.printGraph(result);
    }
}
